An Algebraic Characterization of Strictly Piecewise Languages
نویسندگان
چکیده
This paper provides an algebraic characterization of the Strictly Piecewise class of languages studied by Rogers et al. 2010. These language are a natural subclass of the Piecewise Testable languages (Simon 1975) and are relevant to natural language. The algebraic characterization highlights a similarity between the Strictly Piecewise and Strictly Local languages, and also leads to a procedure which can decide whether a regular language L is Strictly Piecewise in polynomial time in the size of the syntactic monoid for L.
منابع مشابه
Piecewise testable languages via combinatorics on words
A regular language L over an alphabet A is called piecewise testable if it is a finite boolean combination of languages of the form Aa1A a2A ∗ . . . Aa`A ∗, where a1, . . . , a` ∈ A, ` ≥ 0. An effective characterization of piecewise testable languages was given in 1972 by Simon who proved that a language L is piecewise testable if and only if its syntactic monoid is J -trivial. Nowadays there e...
متن کاملModular and Threshold Subword Counting and Matrix Representations of Finite Monoids
The subword relation reveals interesting combinatorial properties and plays a prominent role in formal language theory. For instance, recall that languages consisting of all words over Σ having a given word u ∈ Σ∗ as a subword serve as a generating system for the Boolean algebra of so-called piecewise testable languages. It was a deep study of combinatorics of the subword relation that led Simo...
متن کاملEstimating Strictly Piecewise Distributions
Strictly Piecewise (SP) languages are a subclass of regular languages which encode certain kinds of long-distance dependencies that are found in natural languages. Like the classes in the Chomsky and Subregular hierarchies, there are many independently converging characterizations of the SP class (Rogers et al., to appear). Here we define SP distributions and show that they can be efficiently e...
متن کاملA Recurrent Neural Network for Solving Strictly Convex Quadratic Programming Problems
In this paper we present an improved neural network to solve strictly convex quadratic programming(QP) problem. The proposed model is derived based on a piecewise equation correspond to optimality condition of convex (QP) problem and has a lower structure complexity respect to the other existing neural network model for solving such problems. In theoretical aspect, stability and global converge...
متن کاملOn Languages Piecewise Testable in the Strict Sense
In this paper we explore the class of Strictly Piecewise languages, originally introduced to characterize long-distance phonotactic patterns by Heinz [7] as the Precedence Languages. We provide a series of equivalent abstract characterizations, discuss their basic properties, locate them relative to other well-known subregular classes and provide algorithms for translating between the grammars ...
متن کامل